Factorization of Large Numbers using Reconfigurable Devices
نویسندگان
چکیده
We propose to implement the Mesh Design for implementing the Number Field Sieve particularly which will be used to perform the Matrix step to do Matrix Multiplication. Mesh approach is proposed by Daniel Bernstein which brought down the cost of Number Field Sieve by significant factor especially in the matrix step[5]. The computation is done in the mesh-connected array of processors, which utilizes local memory efficiently compared to PC based implementation. Mesh Design is also used in sieving step[12][32]. Bernstein proposed the Mesh Sorting method for matrix-vector multiplication, which uses Schimmler’s sorting. The Schimmler’s sorting is used to sort m numbers in 8m-8 steps. So the complexity of matrix-vector multiplication reduces by a square root of normal computation time needed. Shamir-Tromer proposed the Mesh Routing method for the matrix-vector multiplication, which has the same complexity benefit as in Mesh Sorting [6].
منابع مشابه
Reconfigurable Hardware Implementation and Analysis of Mesh Routing for the Matrix Step of the Number Field Sieve Factorization
RECONFIGURABLE HARDWARE IMPLEMENTATION AND ANALYSIS OF MESH ROUTING FOR THE MATRIX STEP OF NUMBER FIELD SIEVE FACTORIZATION Sashisu M. Bajracharya, M.S. George Mason University, 2004 Thesis Director: Dr. Kris Gaj Factorization of large numbers has been a constant source of interest as it is the basis of security for the well-known RSA cryptosystem. The fastest known algorithm for factoring larg...
متن کاملReconfigurable Hardware Implementation of Mesh Routing in the Number Field Sieve Factorization
Factorization of large numbers has been a constant source of interest in cryptanalysis. The fastest known algorithm for factoring large numbers is the Number Field Sieve (NFS). The two most time consuming phases of NFS are Sieving and Matrix Step. In this paper, we propose an efficient way of implementing the Matrix step in reconfigurable hardware. Our solution is based on the MeshRouting metho...
متن کاملThis is a placeholder. Final title will be filled later
Factorization of large numbers has been a constant source of interest in cryptanalysis. The fastest known algorithm for factoring large numbers is the Number Field Sieve (NFS). The two most time consuming phases of NFS are Sieving and Matrix Step. In this paper, we propose an efficient way of implementing the Matrix step in reconfigurable hardware. Our solution is based on the MeshRouting metho...
متن کاملImplementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey
Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...
متن کاملAdaptive Protection Based on Intelligent Distribution Networks with the Help of Network Factorization in the Presence of Distributed Generation Resources
Factorizing a system is one of the best ways to make a system intelligent. Factorizing the protection system, providing the right connecting agents, and transmitting the information faster and more reliably can improve the performance of a protection system and maintain system reliability against distributed generation resources. This study presents a new method for coordinating network protect...
متن کامل